Neighbor-joining revealed.

نویسندگان

  • Olivier Gascuel
  • Mike Steel
چکیده

It is nearly 20 years since the landmark paper (Saitou and Nei 1987) in Molecular Biology and Evolution introducing Neighbor-Joining (NJ). The method has become the most widely used method for building phylogenetic trees from distances, and the original paper has been cited about 13,000 times (Science Citation Index). Yet the question "what does the NJ method seek to do?" has until recently proved somewhat elusive, leading to some imprecise claims and misunderstanding. However, a rigorous answer to this question has recently been provided by further mathematical investigation, and the purpose of this note is to highlight these results and their significance for interpreting NJ. The origins of this story lie in a paper by Pauplin (2000) though its continuation has unfolded in more mathematically inclined literature. Our aim here is to make these findings more widely accessible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Phylogenetic analyses of amino acid variation in the serpin proteins.

Phylogenetic analyses of 110 serpin protein sequences revealed clades consistent with independent phylogenetic analyses based on exon-intron structure and diagnostic amino acid sites. Trees were estimated by maximum likelihood, neighbor joining, and partial split decomposition using both the BLOSUM 62 and Jones-Taylor-Thornton substitution matrices. Neighbor-joining trees gave results closest t...

متن کامل

Fe b 20 06 WHY NEIGHBOR - JOINING WORKS

We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson’s optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson’s criterion is not satisfied. We also provide a proof for Atteson’s conjecture on the optimal edge radi...

متن کامل

Estimating molecular phylogeny of some Indian termites combining partial COI sequences

To study the phylogenetic relationships of Indian termites (Insecta: Isoptera), mitochondrial DNA sequences of 334 bp of Cytochrome Oxidase subunit I gene of nine species were subjected to MEGA 5.2. Phylogenetic trees were constructed using Neighbor-Joining and Maximum Likelihood methods. The results revealed the phylogenetic status of Indian termites with other species from different geographi...

متن کامل

FastJoin, an improved neighbor-joining algorithm.

Reconstructing the evolutionary history of a set of species is an elementary problem in biology, and methods for solving this problem are evaluated based on two characteristics: accuracy and efficiency. Neighbor-joining reconstructs phylogenetic trees by iteratively picking a pair of nodes to merge as a new node until only one node remains; due to its good accuracy and speed, it has been e...

متن کامل

Implementation of Some Similarity Coefficients in Conjunction with Multiple Upgma and Neighbor-joining Algorithms for Enhancing Phylogenetic Trees

Random Amplified Polymorphic DNA (RAPD) markers was used to analyze the genetic structure of five Indigenous Egyptian’s chicken populations including Fayoumi, Dokki-4, Golden Montazah, Silver Montazah, and ElSalam, based on the taxa generated by the analysis of ten RAPD markers. The population genetic distances were estimated by using two cluster algorithms (UPGMA & NJ neighbor-joining) accompa...

متن کامل

The robustness of two phylogenetic methods: four-taxon simulations reveal a slight superiority of maximum likelihood over neighbor joining.

The robustness (sensitivity to violation of assumptions) of the maximum-likelihood and neighbor-joining methods was examined using simulation. Maximum likelihood and neighbor joining were implemented with Jukes-Cantor, Kimura, and gamma models of DNA substitution. Simulations were performed in which the assumptions of the methods were violated to varying degrees on three model four-taxon trees....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Molecular biology and evolution

دوره 23 11  شماره 

صفحات  -

تاریخ انتشار 2006